Probabilistic Inference in In uence Diagrams
نویسنده
چکیده
This paper is about reducing innuence diagram (ID) evaluation into Bayesian network (BN) inference problems that are as easy to solve as possible. Such reduction is interesting because it enables one to readily use one's favorite BN inference algorithm to eeciently evaluate IDs. Two such reduction methods have been proposed previously (Cooper 1988, Shachter and Peot 1992). This paper proposes a new method. The BN inference problems induced by the mew method are much easier to solve than those induced by the two previous methods.
منابع مشابه
A Simple Method to Evaluate In uence Diagrams
In uence diagrams (IDs) provide a concise graphical formulation for decision making in intelligent agents. In this work, we propose a simple method to evaluate IDs by rst converting IDs into BNs and then applying a junction tree-based inference algorithm. The methods are more e cient than methods in [1, 5] and are simpler than [6]. (
متن کاملDynamic programming in in uence diagrams with decision circuits
Decision circuits perform efficient evaluation of influence diagrams, building on the advances in arithmetic circuits for belief network inference [Darwiche, 2003; Bhattacharjya and Shachter, 2007]. We show how even more compact decision circuits can be constructed for dynamic programming in influence diagrams with separable value functions and conditionally independent subproblems. Once a deci...
متن کاملCompiling Probabilistic Logic Programs into Sentential Decision Diagrams
Knowledge compilation algorithms transform a probabilistic logic program into a circuit representation that permits efficient probability computation. Knowledge compilation underlies algorithms for exact probabilistic inference and parameter learning in several languages, including ProbLog, PRISM, and LPADs. Developing such algorithms involves a choice, of which circuit language to target, and ...
متن کاملA geometric proof of con uence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملThe Prediction of Forming Limit Diagram of Low Carbon Steel Sheets Using Adaptive Fuzzy Inference System Identifier
The paper deals with devising the combination of fuzzy inference systems (FIS) and neural networks called the adaptive network fuzzy inference system (ANFIS) to determine the forming limit diagram (FLD). In this paper, FLDs are determined experimentally for two grades of low carbon steel sheets using out-of-plane (dome) formability test. The effect of different parameters such as work hardening...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998